Perbandingan Metode K-Means dan GA K-Means untuk Clustering Dataset Heart Disease Patients

نویسندگان

چکیده

Penyakit jantung adalah kondisi dimana sebagai organ vital manusia mengalami gangguan dan tidak berfungsi dengan baik merupakan penyakit yang paling mematikan di dunia serta menjadi penyebab utama kematian secara global, total sekitar 17,9 juta jiwa per tahunnya. Pada penelitian ini dilakukan pengelompokkan data pasien terdiagnosis untuk melihat karakteristik persamaan dari setiap pasien. Dataset digunakan dataset Heart Disease Patients berjumlah 303 medis 11 atribut atau fitur. Metode K-Means GA pengelompokan. Algoritma genetika mengoptimasi centroid awal K-Means. Hasil dievaluasi mencatat iterasi, inter cluster intra masing-masing metode pengelompokkan. mampu terlihat rata-rata iterasi 13,4 12,5 maksimum turun 21 17 iterasi. Berdasarkan hasil perhitungan cluster, lebih dibandingkan sangat kecil perbedaannya, sedikit daripada

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل

Adaptive K-Means Clustering

Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering is based on K-means such that the data is partitioned into K clusters. In this method, the number of clusters is predefined and the technique is highly dependent on the initial identification of elements that represent...

متن کامل

Constrained K-Means Clustering

We consider practical methods for adding constraints to the K-Means clustering algorithm in order to avoid local solutions with empty clusters or clusters having very few points. We often observe this phenomena when applying K-Means to datasets where the number of dimensions is n 10 and the number of desired clusters is k 20. We propose explicitly adding k constraints to the underlying clusteri...

متن کامل

Subspace K-means clustering.

To achieve an insightful clustering of multivariate data, we propose subspace K-means. Its central idea is to model the centroids and cluster residuals in reduced spaces, which allows for dealing with a wide range of cluster types and yields rich interpretations of the clusters. We review the existing related clustering methods, including deterministic, stochastic, and unsupervised learning app...

متن کامل

k-means clustering

The sets Sj are the sets of points to which μj is the closest center. In each step of the algorithm the potential function is reduced. Let’s examine that. First, if the set of centers μj are fixed, the best assignment is clearly the one which assigns each data point to its closest center. Also, assume that μ is the center of a set of points S. Then, if we move μ to 1 |S| ∑ i∈S xi then we only r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JATISI: Jurnal Teknik Informatika dan Sistem Informasi

سال: 2022

ISSN: ['2503-2933', '2407-4322']

DOI: https://doi.org/10.35957/jatisi.v9i3.2799